Elliptic Curves, Primality Proving and Some Titanic Primes
ثبت نشده
چکیده
We describe how to generate large primes using the primality proving algorithm of Atkin. Figure 1: The Titanic .
منابع مشابه
Distributed Primality Proving and the Primality of (23539+1)/3
We explain how the Elliptic Curve Primality Proving algorithm can be implemented in a distributed way. Applications are given to the certiication of large primes (more than 500 digits). As a result, we describe the successful attempt at proving the primality of the 1065-digit (2 3539 +1)=3, the rst ordinary Titanic prime.
متن کاملCyclotomy Primality Proving
Two rational primes p, q are called dual elliptic if there is an elliptic curve E mod p with q points. They were introduced as an interesting means for combining the strengths of the elliptic curve and cyclotomy primality proving algorithms. By extending to elliptic curves some notions of galois theory of rings used in the cyclotomy primality tests, one obtains a new algorithm which has heurist...
متن کاملSome remarks on primality proving and elliptic curves
We give an overview of a method for using elliptic curves with complex multiplication to give efficient deterministic polynomial time primality tests for the integers in sequences of a special form. This technique has been used to find the largest proven primes N for which there was no known significant partial factorization of N − 1 or N + 1.
متن کاملDeterministic primality tests based on tori and elliptic curves
We develop a general framework for producing deterministic primality tests based on commutative group schemes over rings of integers. Our focus is on the cases of algebraic tori and elliptic curves. The proposed general machinery provides several series of tests which include, as special cases, tests discovered by Gross and by Denomme and Savin for Mersenne and Fermat primes, primes of the form...
متن کاملPrimality Proving via One round in Ecpp and One Iteration
On August 2002, Agrawal, Kayal and Saxena announced the first deterministic and polynomial time primality testing algorithm. For an input n, the AKS algorithm runs in heuristic time Õ(log n). Verification takes roughly the same amount of time. On the other hand, the Elliptic Curve Primality Proving algorithm (ECPP) runs in random heuristic time Õ(log n) ( Õ(log n) if the fast multiplication is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1989